A massively parallel solution strategy for efficient thermal radiation simulation

Casting Pearls Ballistically: Efficient Massively Parallel Simulation of Particle Deposition

of spherical particles are ‘‘cast’’ vertically over a planar horizontal sions, X and Z, and then we generated the deposition over surface. Upon first contact (with the surface or with a previously a segment of length 10 particle-diameter units. Unlike this deposited particle) each particle stops. This model helps material example, interesting simulations are in 3D. In order to scientists to stu...

Time-parallel methods for massively parallel solution of PDEs

Todays fastest supercomputers already feature more than a million cores and this number is expected to rise beyond 100 million over the next decade. Because at the same time frequencies of individual processors remain constant or even decrease for reasons of efficiency, developers are increasingly confronted with the fact that accelerating numerical (but also other) codes necessarily requires t...

Efficient, Massively Parallel Eigenvalue Computation

In numerical simulations of disordered electronic systems, one of the most common approaches is to diagonalize random Hamiltonian matrices and to study the eigenvalues and eigenfunctions of a single electron in the presence of a random potential. In this paper, we describe an effort to implement a matrix diagonalization routine for real symmetric dense matrices on massively parallel SIMD comput...

Efficient Massively Parallel Transport Sweeps

The full-domain “sweep,” in which all angular fluxes in a problem are calculated given previous-iterate values only for the volumetric source, forms the foundation for many iterative methods that have desirable properties [1]. One important property is that iteration counts do not grow with mesh refinement [1]. The sweep solution on parallel machines is complicated by the dependency of a given ...

Stochastic Network Problems: Massively Parallel Solution